A Proof Calculus for Natural Semantics Based on Greatest Fixed Point Semantics
نویسندگان
چکیده
منابع مشابه
A Proof Calculus for Natural Semantics Based on Greatest Fixed Point Semantics
Formal semantics of programming languages needs to model the potentially infinite state transition behavior of programs as well as the computation of their final results simultaneously. This requirement is essential in correctness proofs for compilers. We show that a greatest fixed point interpretation of natural semantics is able to model both aspects equally well. Technically, we infer this i...
متن کاملGödel FL_0 with Greatest Fixed-Point Semantics
We study the fuzzy extension of FL0 with semantics based on the Gödel t-norm. We show that gfp-subsumption w.r.t. a nite set of primitive de nitions can be characterized by a relation on weighted automata, and use this result to provide tight complexity bounds for reasoning in this logic.
متن کاملA Fixed Point Semantics for the ATMS
In CTW90], the ATMS resolution mechanisms have been formalized, using the concept of DK-tree. We propose in this paper a new and simple approach based on the xed point theory and an original demonstration of the completeness of these mechanisms. We rst introduce the basic deenitions of terms, sets and functions which are used in the paper and build a lattice. Then, the basic formal tools to des...
متن کاملA Bilattice Based Fixed Point Semantics for Integrating Imperfect Information
We present an approach to reasoning non-uniformly by default with uncertain, incomplete and inconsistent information using sets of rules/extended logic programs in the context of logics with a bilattice structure. A fixed point semantics for extended logic programs used in the process of inference is described, along with its computational approach. We show how this theoretic approach is applic...
متن کاملLeast and greatest fixed points of a while semantics function
The meaning of a program is given by specifying the function (from input to output) that corresponds to the program. The denotational semantic definition, thus maps syntactical things into functions. A relational semantics is a mapping of programs to relations. We consider that the input-output semantics of a program is given by a relation on its set of states. In a nondeterministic context, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2005
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2005.02.011